Updating QR factorization procedure for solution of linear least squares problem with equality constraints

نویسندگان

  • Salman Zeb
  • Muhammad Yousaf
چکیده

In this article, we present a QR updating procedure as a solution approach for linear least squares problem with equality constraints. We reduce the constrained problem to unconstrained linear least squares and partition it into a small subproblem. The QR factorization of the subproblem is calculated and then we apply updating techniques to its upper triangular factor R to obtain its solution. We carry out the error analysis of the proposed algorithm to show that it is backward stable. We also illustrate the implementation and accuracy of the proposed algorithm by providing some numerical experiments with particular emphasis on dense problems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Equality Constrained Indefinite Least Squares Problem : Theory and Algorithms ∗ †

We present theory and algorithms for the equality constrained indefinite least squares problem, which requires minimization of an indefinite quadratic form subject to a linear equality constraint. A generalized hyperbolic QR factorization is introduced and used in the derivation of perturbation bounds and to construct a numerical method. An alternative method is obtained by employing a generali...

متن کامل

Accuracy and Stability of the Null Space Method for Solving the Equality Constrained Least Squares Problem

The null space method is a standard method for solving the linear least squares problem subject to equality constraints (the LSE problem). We show that three variants of the method, including one used in LAPACK that is based on the generalized QR factorization, are numerically stable. We derive two perturbation bounds for the LSE problem: one of standard form that is not attainable, and a bound...

متن کامل

Implementing QR factorization updating algorithms on GPUs

Linear least squares problems are commonly solved by QR factorization. When multiple solutions have to be computed with only minor changes in the underlying data, knowledge of the difference between the old data set and the new one can be used to update an existing factorization at reduced computational cost. This paper investigates the viability of implementing QR updating algorithms on GPUs. ...

متن کامل

Row-Wise Backward Stable Elimination Methods for the Equality Constrained Least Squares Problem

It is well known that the solution of the equality constrained least squares (LSE) problem minBx=d ‖b−Ax‖2 is the limit of the solution of the unconstrained weighted least squares problem min x ∥∥ [ μd b ] − [ μB A ] x ∥∥ 2 as the weight μ tends to infinity, assuming that [B A ] has full rank. We derive a method for the LSE problem by applying Householder QR factorization with column pivoting t...

متن کامل

A New Much Faster and Simpler Algorithm for Lapack Dgels

We present new algorithms for computing the linear least squares solution to overde-termined linear systems and the minimum norm solution to underdetermined linear systems. For both problems, we consider the standard formulation min kAX ? BkF and the transposed formulation min kA T X ? BkF , i.e, four diierent problems in all. The functionality of our implementation corresponds to that of the L...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره 2017  شماره 

صفحات  -

تاریخ انتشار 2017